Article Per Year (5 Year)
p-Index From 2019 - 2024
1.879
P-Index
This Author published in this journals
All Journal Jurnal Informatika Jurnal Teknik Industri JIK Jurnal Ilmu Komputer Jurnal Sistem Komputer BERKALA SAINSTEK Prosiding SNATIKA Vol 01 (2011) Proceeding of the Electrical Engineering Computer Science and Informatics INFORMAL: Informatics Journal UNEJ e-Proceeding Proceeding of the Electrical Engineering Computer Science and Informatics Management Analysis Journal Health Notions Indonesian Journal of Artificial Intelligence and Data Mining SPIRIT Journal of Indonesia Road Safety Malcom: Indonesian Journal of Machine Learning and Computer Science
Saiful Bukhori
Lecturer, Faculty Of Computer Science, Universitas Jember
Agriculture, Biological Sciences & Forestry Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Dentistry Education Electrical & Electronics Engineering Engineering Health Professions Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Mathematics Medicine & Pharmacology Nursing Physics Public Health Social Sciences Transportation

Published : 27 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 9 Documents
Search
Journal : INFORMAL: Informatics Journal

 1 
Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS Mustika Rahmasuci; Husnul Hotimatus s; Maulia Azizah; Putri Wulandari; Diah Adistia A; Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9852

Abstract

Depth-first search algorithm are blind search process and deepen search follow a single track until found goal. Maze is complicated network way and tortuous, also have many deadlock. Maze often become a challenge in a game like puzzle, which one there’s an object in start position have find way out on specify position. in this journal we’ll discuss about utilization DFS on maze and fastest time to find way out.
Penerapan Metode Steepest Ascent Hill Climb pada Permainan Puzzle Hairul Anam; Feby Sabilhul Hanafi; Ahmad Fauzal Adifia; Ahmad Firdaus Ababil; Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 2 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i2.9987

Abstract

Puzzle is one example of the application of artificial intelligence, in the process of completion there are many search algorithms that can be applied. The 8 puzzle solution will be faster obtained if the array principle is used with a variation of the Steepest-Ascent Hill Climbing (Hill Climbing algorithm by choosing the sharpest / steepest slope) with the correct heuristic parameters and distance heuristics and combined with LogList as the storage state ever passed to overcome the problems in the hill climbing algorithm itself and avoid the looping state that has been passed. Steepest Ascent Hill Climbing is an algorithm method that is widely used for optimization problems. The application of the SAHC (Steepest Ascent Hill Climbing) Algorithm to the puzzle is needed so that the game is completed with optimal time.
Implementasi Metode Hybrid AHP dan TOPSIS pada Sistem Pendukung Keputusan Pemilihan Lokasi Tempat Pembuangan Sampah Sementara Bayhaqqi Bayhaqqi; Saiful Bukhori; Gayatri Dwi Santika
INFORMAL: Informatics Journal Vol 6 No 2 (2021): Informatics Journal (INFORMAL)
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v6i2.25648

Abstract

Temporary Waste Disposal Site (TPSS) is a place to collect waste from various community activities which will later be transported to the final disposal site by garbage trucks. There are many considerations in choosing a TPSS location, so the selection of a TPSS location is very important in supporting the collection of waste that will be transported to final disposal. The Jember Regency Environmental Service is an agency in charge of waste management, including the selection of TPSS locations. Choosing the location of TPSS so far is still manual, where manual selection cannot be separated from human error, so that choosing the location of TPSS is not accurate can cause new problems in the community. In addition, there is no standardized assessment system in the TPSS selection process, so a decision support system is needed that can be used to assist the process of selecting the best TPSS location recommendations. In making this research system, we implemented the hybrid method of AHP and TOPSIS. Where the AHP method is used to determine the weight of the criteria while the TOPSIS method is used for the selection process for TPSS candidates.
FrontCover Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Pemecahan Puzzle Dengan Metode Steepest Ascent Hill Climb Ahmad Firdaus Ababil; Hairul Anam; Feby Sabilhul Hanafi; Ahmad Fauzal Adifia; Saiful Bukhori
INFORMAL: Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Puzzle merupakan salah satu contoh penerapan dari kecerdasan buatan, dalam proses penyelesaiaanya banyak terdapat algoritma-algoritma pencarian yang dapat diterapkan. Solusi 8 puzzle akan lebih cepat diperoleh jika digunakan prinsip array dengan variasi algoritma Steepest-Ascent Hill Climbing (Hill Climbing dengan memilih kemiringan yang paling tajam / curam) dengan parameter heuristik posisi yang benar dan heuristik jarak serta dikombinasikan dengan LogList sebagai penyimpanan state-state yang pernah dilalui untuk menanggulangi permasalah pada algoritma hill climbing itu sendiri dan terhindar dari looping state yang pernah dilalui. Penerapan Algoritma SAHC (Steepest Ascent Hill Climbing) pada puzzle dibutuhkan agar permainan selesai dengan kecerdasan buatan. Steepest Ascent Hill Climbing merupakan metode algoritma yang banyak digunakan untuk permasalahan optimasi. Langkah-langkah dalam perhitungan SAHC (Steepest Ascent Hill Climbing) yaitu : (1) menghitung kotak yang menempati tempat yang benar, (2) hitung pergerakan yang memungkinkan. (3) mendapatkan nilai h(n) menggunakan perhitungan manual dengan menggunakan penjumlahan kotak yang menempati tempat yang benar, (4) membandingkan nilai heuristic dari pergerakan yang mungkin, (5) menerapkan alur pencarian algoritma SAHC (Steepest Ascent Hill Climbing) dengan nilai heuristik h(n) yang telah diperoleh.
Rear Cover Saiful Bukhori
INFORMAL: Informatics Journal Vol 2 No 1 (2017): INFORMAL: INFORMATICS JOURNAL
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS Mustika Rahmasuci; Husnul Hotimatus Sahroh; Maulina Azizah; Putri Wulandari; Diah Adistia; Saiful Bukhori
INFORMAL: Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Depth-first search algorithm are blind search process and deepen search follow a single track until found goal. Maze is complicated network way and tortuous, also have many deadlock. Maze often become a challenge in a game like puzzle, which one there’s an object in start position have find way out on specify position. in this journal we’ll discuss about utilization DFS on maze and fastest time to find way out.
Sistem Informasi Distribusi Cabai Dengan Metode Distribution Requirements Planning (DRP) di Provinsi Jawa Timur Nur Kholis Mansur; Saiful Bukhori; Oktalia Juwita
INFORMAL: Informatics Journal Vol 4 No 1 (2019): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v4i1.12288

Abstract

Chili production in East Java in 2016 reached nearly 2 million tons with details of 1 million tons of chili and large chili 939 thousand tons. The abundant amount of chili production is still the cause of inflation. The inflation factor is caused by several factors, one of which is the abundant amount of chili production but occurs in certain months or other causes are uneven distribution. The chili production center in East Java is still experiencing problems with distribution activities in meeting the demands of chili every city. Shipments carried out in East Java also do not have an optimal value to meet the number of requests. The poor delivery plan also caused errors in arranging inventory to make deliveries. The East Java government needs a way to analyze the distribution of chili by planning scheduling to improve the ability to fulfill chili demand using the Distribution Requirement Planning (DRP) method. Planning using this DRP method can produce an analysis of the gross needs and needs of chili in each city with the level of service used in the safety stock is 90%, with a normal distribution table that is equal to 1.28.
REAR COVER Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Co-Authors Ahmad Fauzal Adifia Ahmad Firdaus Ababil Ahmad Firdaus Ababil Al Munawir Angga Ari Wijaya Basbeth, Faishal Bayhaqqi Bayhaqqi Dewi Kholifatul Ummah Dewi Rokhmah Diah Adistia Diah Adistia A Fahruddin Arrasyid Alfansuri Faishal Basbeth Feby Sabilhul Hanafi Hairul Anam Haryanto, Kurniawan Wahyu Hastungkara, Duhita Husnul Hotimatus s Husnul Hotimatus Sahroh I Ketut Eddy Purnama Luh Putu Ratna Sundari Markus Apriono Maulia Azizah Maulina Azizah Mauridhi Heri Purnomo Mochamad Hariadi Mohammad Ovi Sanjaya Muhammad Noor Dwi Eldianto Muhammad `Ariful Furqon Mustika Rahmasuci Mustika Rahmasuci Nafolion Nur Rahmat Nafolion Nur Rahmat, Nafolion Nur Nelly Oktavia Nur Kholis Mansur Oktalia Juwita Putra, Januar Adi PUTRI WULANDARI Santika, Gayatri Dwi Shasha Nur Faadhilah Sonya Sulistyono Sri Hernawati Umroh Makhmudah Vivi Sefrinta Izza Afkarina Wiji Utami Windi Eka Yulia Retnani Yudhi Tri Gunawan